Diameter vulnerability of graphs by edge deletion
نویسندگان
چکیده
منابع مشابه
Diameter vulnerability of graphs by edge deletion
Let f (t, k) be the maximum diameter of graphs obtained by deleting t edges from a (t+1)-edge-connected graph with diameter k. This paper shows 4 √ 2t−6 < f (t, 3) ≤ max{59, 5 √ 2t+7} for t ≥ 4, which corrects an improper result in [C. Peyrat, Diameter vulnerability of graphs, Discrete Appl. Math. 9 (3) (1984) 245–250] and also determines f (2, k) = 3k − 1 and f (3, k) = 4k − 2 for k ≥ 3. c © 2...
متن کاملDiameter vulnerability of GC graphs
Concern over fault tolerance in the design of interconnection networks has stimulated interest in finding large graphs with maximum degree ∆ and diameter D such that the subgraphs obtained by deleting any set of s vertices have diameter at most D′, this value being close to D or even equal to it. This is the so-called (∆, D, D′, s)-problem. The purpose of this work has been to study this proble...
متن کاملDiameter of paired domination edge-critical graphs
A paired dominating set of a graph G without isolated vertices is a dominating set of G whose induced subgraph has a perfect matching. The paired domination number γpr(G) of G is the minimum cardinality amongst all paired dominating sets of G. The graph G is paired domination edge-critical (γprEC) if for every e ∈ E(G), γpr(G+ e) < γpr(G). We investigate the diameter of γprEC graphs. To this ef...
متن کاملVulnerability of super edge-connected graphs
A subset F of edges in a connected graph G is a h-extra edge-cut if G − F is disconnected and every component has more than h vertices. The h-extra edge-connectivity λ(G) of G is defined as the minimum cardinality over all h-extra edge-cuts of G. A graph G, if λ(G) exists, is super-λ if every minimum h-extra edge-cut of G isolates at least one connected subgraph of order h + 1. The persistence ...
متن کاملEdge Deletion Preserving the Diameter of the Hypercube
We give upper and lower bounds to the number un(Q.) of edges that one can remove from a hypercube without altering its diameter, namely: (n 2) 2”-’ ( ( Ln;2,) ) + 2 < un( Qn) < (n 2)2”_’ + 1 [(2” 1)/(2nl)].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.01.006